منابع مشابه
A Generalized Symbolic Thomas Algorithm
The current paper is mainly devoted to construct a generalized symbolic Thomas algorithm that will never fail. Two new efficient and reliable computational algorithms are given. The algorithms are suited for implementation using computer algebra systems (CAS) such as Mathematica, Macsyma and Maple. Some illustrative examples are given.
متن کاملA symbolic-numeric silhouette algorithm
We have revisited the silhouette algorithm developed by Canny, and designed its new symbolic-numeric version. The symbolic-numeric silhouette algorithm do not require the symbolic computation of the determinants of resultant matrices, and can work on oating point arithmetic. Though its combinatorial complexity remains the same, but its algebraic complexity has been improved signi cantly which i...
متن کاملA Fully Symbolic Bisimulation Algorithm
We apply the saturation heuristic to the bisimulation problem for deterministic discrete-event models, obtaining the fastest to date symbolic bisimulation algorithm, able to deal with large quotient spaces. We compare performance of our algorithm with that of Wimmer et al., on a collection of models. As the number of equivalence classes increases, our algorithm tends to have improved time and s...
متن کاملSymbolic Neural Symbolic Algorithm/ Algorithm Network Neural Network
Neural networks offer an intriguing set of techniques for learning based on the ad-justment of weights of connections between processing units. However, the powerand limitations of connectionist methods for learning, such as the method of backpropagation in parallel distributed processing networks, are not yet entirely clear.We report on a set of experiments that more precisely ...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2012
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2012.34052